On Matching Point Configurations
نویسندگان
چکیده
We present an algorithm that verifies if two unlabeled configurations of N points in Rd are or are not an orthogonal transformation of one another, and if applicable, explicitly compute that transformation. We also give a formula for the orthogonal transformation in the case of noisy measurements. AMS subject classification: 65F15, 65F35, 65G99.
منابع مشابه
Geometric Matching of 3-D Objects: Assessing the Range of Successful Initial Configurations
This paper considers the matching of 3D objects by a geometric approach based on the iterative closest point algorithm (ICP), which, starting from an initial configuration of two rigid objects, iteratively finds their best correspondence. The algorithm does not converge always to the best solution. It can be trapped in a local minimum and miss the optimum matching. While the convergence of this...
متن کاملBayesian alignment using hierarchical models, with applications in protein bioinformatics
An important problem in shape analysis is to match configurations of points in space after filtering out some geometrical transformation. In this paper we introduce hierarchical models for such tasks, in which the points in the configurations are either unlabelled or have at most a partial labelling constraining the matching, and in which some points may only appear in one of the configurations...
متن کاملINSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Algebraic Relations among Matching Constraints of Multiple Images
Given a set of n 2 2 uncalibrated views, for any corresponding point across n views, there exist three types of matching constraints: bilinear constraints (for n 2 2), trilinear constraints (for n 2 3, [12]) and quadrilinear constraints (for n 2 4, 16, 14, 31). The exact algebraic relations among these multi-1inea.r constraints have not been elu~ida~ted by previous authors. This paper examines ...
متن کاملCompact Lossy Inductance Simulators With Electronic Control
In this paper two R‑L network simulator configurations employing a single VDDIBA, one resistance and one grounded capacitance are presented. The first configuration is a grounded series resistor-inductor (R‑L) network simulator and the second configuration is intended for grounded parallel resister-inductor (R‑L) circuit simulation. Both the proposed circuits enjoy several beneficial features s...
متن کاملMatching Rules for Collective Behaviors on Complex Networks: Optimal Configurations for Vibration Frequencies of Networked Harmonic Oscillators
The structure-dynamics-function has become one of central problems in modern sciences, and it is a great challenge to unveil the organization rules for different dynamical processes on networks. In this work, we study the vibration spectra of the classical mass spring model with different masses on complex networks, and pay our attention to how the mass spatial configuration influences the seco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012